Molecular descriptors of certain OTIS interconnection networks
نویسندگان
چکیده
منابع مشابه
Topologies for Optical Interconnection Networks Based on Otis
Many results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential eeort has yet to be done in linking those results together. In this paper, we propose a step in this direction , by giving optical layouts for several graph-theoretical topologies studied in the literature, using the Optical Transpose Interconnec...
متن کاملA new otis-arrangment interconnection network
In this paper, we propose a new interconnection network called Optical Transpose Interconnection Systems (OTIS) Arrangement Network which is constructed from the cross product of the factor Arrangement network. This paper utilizes the features of optical transpose interconnection systems networks which use both of electronic and optical networks. Many recent studies have showed that optical tra...
متن کاملAn extended OTIS-Cube interconnection network
This paper proposes a new extended OTIS-Cube Interconnection network of the well known class of network, OTIS-Cube. This paper presents attractive topological properties for the new network which carry a way the weakness of some topological properties of the OTIS-Cube found in the degree and the diameter. The new network has a regular degree, a small diameter, and a semantic structure. An effic...
متن کاملBiswapped networks: a family of interconnection architectures with advantages over swapped or OTIS networks
In this paper, we propose a new family of communication architectures, called “biswapped networks” (BSNs). Each BSN is built of 2n copies of some n-node basis network using a simple rule for connectivity that ensures its regularity, modularity, fault tolerance, and algorithmic efficiency. In particular, if the basis network is a Cayley digraph then so is the resulting BSN. Our biswapped connect...
متن کاملOn Induced Matching Partitions of Certain Interconnection Networks
The induced matching partition number of a graph G, denoted by imp(G), is the minimum integer k such that V(G) has a k-partition (V1, V2 ... Vk ) such that, for each i, 1 ≤ i ≤ k, G[Vi], the subgraph of G induced by Vi, is a 1-regular graph. The induced matching k-partition problem is NP-complete even for k = 2. In this paper we investigate the induced matching partition problem for butterfly n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proyecciones (Antofagasta)
سال: 2020
ISSN: 0717-6279
DOI: 10.22199/issn.0717-6279-2020-04-0048